By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Optimization

Table of Contents
Volume 19, Issue 3, pp. 1003-1509

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints

A. F. Izmailov and M. V. Solodov

pp. 1003-1027

A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems

Lingchen Kong, Jie Sun, and Naihua Xiu

pp. 1028-1047

Variational Analysis of Pseudospectra

Adrian S. Lewis and C. H. Jeffrey Pang

pp. 1048-1072

On the Second-Order Feasibility Cone: Primal-Dual Representation and Efficient Projection

Alexandre Belloni and Robert M. Freund

pp. 1073-1092

Relaxed Alternating Projection Methods

Andrzej Cegielski and Agnieszka Suchocka

pp. 1093-1106

Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence

Elaine T. Hale, Wotao Yin, and Yin Zhang

pp. 1107-1130

Polyhedral Results for 1-Restricted Simple 2-Matchings

David Hartvigsen and Yanjun Li

pp. 1131-1149

Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm

Charles Audet, J. E. Dennis Jr., and Sébastien Le Digabel

pp. 1150-1170

Smooth Optimization with Approximate Gradient

Alexandre d'Aspremont

pp. 1171-1183

A New Unblocking Technique to Warmstart Interior Point Methods Based on Sensitivity Analysis

Jacek Gondzio and Andreas Grothey

pp. 1184-1210

The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs

M. C. Campi and S. Garatti

pp. 1211-1230

Global Convergence of Filter Methods for Nonlinear Programming

Ademir A. Ribeiro, Elizabeth W. Karas, and Clóvis C. Gonzaga

pp. 1231-1249

Parameterized Minimax Problem: On Lipschitz-Like Dependence of the Solution with Respect to the Parameter

Marc Quincampoix and Nadia Zlateva

pp. 1250-1269

On Bin Packing with Conflicts

Leah Epstein and Asaf Levin

pp. 1270-1298

Dynamic Control of Infeasibility in Equality Constrained Optimization

Roberto H. Bielschowsky and Francisco A. M. Gomes

pp. 1299-1325

Optimization Problems with Second Order Stochastic Dominance Constraints: Duality, Compact Formulations, and Cut Generation Methods

Gábor Rudolf and Andrzej Ruszczyński

pp. 1326-1343

A Minimax Theorem with Applications to Machine Learning, Signal Processing, and Finance

Seung-Jean Kim and Stephen Boyd

pp. 1344-1367

Two Algorithms for the Minimum Enclosing Ball Problem

E. Alper Yildirim

pp. 1368-1391

Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem

S. Damla Ahipasaoğlu and E. Alper Yildirim

pp. 1392-1396

Iterative Minimization Schemes for Solving the Single Source Localization Problem

Amir Beck, Marc Teboulle, and Zahar Chikishev

pp. 1397-1416

A Simplified Approach to Semismooth Newton Methods in Function Space

Anton Schiela

pp. 1417-1432

New Formulations for Optimization under Stochastic Dominance Constraints

James Luedtke

pp. 1433-1450

The Convex Envelope of ($n$–1)-Convex Functions

Matthias Jach, Dennis Michaels, and Robert Weismantel

pp. 1451-1466

Universal Confidence Sets for Solutions of Optimization Problems

Silvia Vogel

pp. 1467-1488

On Extension of Fenchel Duality and its Application

Li Guoyin and Ng Kung Fu

pp. 1489-1509